From Chess Moves to Legal Decisions: A Position Statement
نویسنده
چکیده
DEEP BLUE’s victoryoverKasparov has confirmedtheideas of thegenuineartificialintelligence researchers, but – and that is more important – it has also opened the eyes of the disbelievers. The latter group is now given to understand that (i) scientific progress in mimicking human chess performances can go as far as outperforming the World Champion, and that (ii) progress in one domain may be transferable to another domain.
منابع مشابه
Response Time Distributions in Rapid Chess: A Large-Scale Decision Making Experiment
Rapid chess provides an unparalleled laboratory to understand decision making in a natural environment. In a chess game, players choose consecutively around 40 moves in a finite time budget. The goodness of each choice can be determined quantitatively since current chess algorithms estimate precisely the value of a position. Web-based chess produces vast amounts of data, millions of decisions p...
متن کاملSequencing Chess
We analyze the structure of the state space of chess by means of transition path sampling Monte Carlo simulation. Based on the typical number of moves required to transpose a given configuration of chess pieces into another, we conclude that the state space consists of several pockets between which transitions are rare. Skilled players explore an even smaller subset of positions that populate s...
متن کاملThe Mate-in-n Problem of Infinite Chess Is Decidable
The mate-in-n problem of infinite chess—chess played on an infinite edgeless board—is the problem of determining whether a designated player can force a win from a given finite position in at most n moves. Although a straightforward formulation of this problem leads to assertions of high arithmetic complexity, with 2n alternating quantifiers, the main theorem of this article nevertheless confir...
متن کاملHomework 10: Markov Chains & Ranking
Consider a standard chessboard with an 8×8 grid of possible locations. We define a Markov chain by randomly moving a single chess piece on this board. The initial location X0 is sampled uniformly among the 8 = 64 squares. At time t, the piece then chooses Xt+1 by sampling uniformly from the set of legal moves given its current location Xt. For a description of legal chess moves, see: http://en....
متن کاملGiraffe: Using Deep Reinforcement Learning to Play Chess
This report presents Giraffe, a chess engine that uses self-play to discover all its domain-specific knowledge, with minimal hand-crafted knowledge given by the programmer. Unlike previous attempts using machine learning only to perform parametertuning on hand-crafted evaluation functions, Giraffe’s learning system also performs automatic feature extraction and pattern recognition. The trained ...
متن کامل